On the relationship between NLC-width and linear NLC-width

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a disparity between relative cliquewidth and relative NLC-width

Cliquewidth and NLC-width are two closely related parameters that measure the complexity of graphs. Both cliqueand NLC-width are defined to be the minimum number of labels required to create a labelled graph by certain terms of operations. Many hard problems on graphs become solvable in polynomial-time if the inputs are restricted to graphs of bounded cliqueorNLC-width. Cliquewidth andNLC-width...

متن کامل

The NLC-width and clique-width for powers of graphs of bounded tree-width

The k-power graph of a graph G is a graphwith the same vertex set as G, in that two vertices are adjacent if and only if, there is a path between them in G of length at most k. A k-treepower graph is the k-power graph of a tree, a k-leaf-power graph is the subgraph of some k-tree-power graph induced by the leaves of the tree. We show that (1) every k-tree-power graph has NLC-width at most k + 2...

متن کامل

On switching classes, NLC-width, cliquewidth and treewidth

In this paper we consider a connection between switching (of undirected graphs), and the notions of NLC-width, cliquewidth and treewidth. In particular, we show that the NLC-widths and the cliquewidths of two graphs in a switching class are at most a constant factor apart (2 for the former, 4 for the latter). A similar result can be shown not to hold for treewidth: it is easy to find a switchin...

متن کامل

On a Disparity Between Relative Cliquewidth and Relative NLC - width by Haiko Müller & Ruth Urner December 2008

Cliquewidth and NLC-width are two closely related parameters that measure the complexity of graphs. Both cliqueand NLC-width are defined to be the minimum number of labels required to create a labelled graph by certain terms of operations. Many hard problems on graphs become solvable in polynomial time if the inputs are restricted to graphs of bounded cliqueor NLC-width. Cliquewidth and NLC-wid...

متن کامل

Nlc ∗

We demonstrate that the process e + e − → tth at the NLC provides a powerful tool for extracting the tt (Yukawa) couplings of the h. In combination with the e + e − → Zh process , an accurate determination of the ZZ coupling of the h is also possible. The resulting ability to distinguish different models of the Higgs sector is illustrated by detailed studies for two-Higgs-doublet models. In ext...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2005

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2005.05.018